Characterizations of the solvable radical

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of Solvable Groups and Solvable radical

We give a survey of new characterizations of finite solvable groups and the solvable radical of an arbitrary finite group which were obtained over the past decade. We also discuss generalizations of these results to some classes of infinite groups and their analogues for Lie algebras. Some open problems are discussed as well.

متن کامل

Thompson-like Characterization of the Solvable Radical

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x ∈ G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite dimensional Lie algebras and some classes of infinite groups. To Charles Leedham-Green on his 65th birthday

متن کامل

Thompson-like Characterization of the Solvable Radical

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x ∈ G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite dimensional Lie algebras and some classes of infinite groups. We also consider a similar problem for pairs of elements.

متن کامل

Multiplicities in Sylow Sequences and the Solvable Radical

A complete Sylow sequence, P = P1, . . . , Pm , of a finite group G is a sequence of m Sylow pi -subgroups of G, one for each pi , where p1, . . . , pm are all of the distinct prime divisors of |G|. A product of the form P1 · · · Pm is called a complete Sylow product of G. We prove that the solvable radical of G equals the intersection of all complete Sylow products of G if, for every compositi...

متن کامل

Characterizations of Natural Submodular Graphs: a Polynomially Solvable Class of the Tsp

Let G = (V, E) be a graph and w: E -» R+ be a length function. Given S C V, a Steiner tour is a cycle passing at least once through each vertex of S . In this paper we investigate naturally submodular graphs: graphs for which the length function of the Steiner tours is submodular. We provide two characterizations of naturally submodular graphs, an 0(n) time algorithm for identifying such graphs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2010

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-09-10066-7